CD(4) has bounded width
نویسندگان
چکیده
We prove that the constraint languages invariant under a short sequence of Jónsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves the previous result by Kiss and Valeriote [16] and presents some evidence that the Larose-Zadori conjecture [19] holds in the congruence-
منابع مشابه
Se p 20 07 CD ( 4 ) has bounded width
We prove that the constraint languages invariant under a short sequence of Jónsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves the previous result by Kiss and Valeriote [16] and presents some evidence that the Larose-Zadori conjecture [19] holds in the congruence-
متن کاملLine graphs of bounded clique-width
We show that a set of graphs has bounded tree-width or bounded path-width if and only if the corresponding set of line graphs has bounded clique-width or bounded linear clique-width, respectively. This relationship implies some interesting algorithmic properties and re-proves already known results in a very simpleway. It also shows that theminimization problem forNLC-width isNP-complete. © 2007...
متن کاملBounded relational width
We prove that CSP(A) for an idempotent algebra A has bounded relational width if and only if var(A) omits the unary and affine types. If it has bounded relational width it has relational width at most 3. The problem, given a relational structure A, decide if CSP(A) has bounded relational width (equivalently, if the variety generated by the corresponding algebra omits the Boolean and affine type...
متن کاملBounding the Clique-Width of H-free Chordal Graphs
A graph is H-free if it has no induced subgraph isomorphic to H . Brandstädt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3 has unbounded clique-width. Brandstädt, Le and Mosca erroneously claimed that the gem and the co-gem are the only two 1-vertex P4-extensions H for which the class of H-free chordal graphs has bounded clique-width. In fa...
متن کاملThe collapse of the bounded width hierarchy
We show that every constraint satisfaction problem over a fixed constraint language that has bounded relational width has also relational width (2, 3). Together with known results this gives a trichotomy for width: a constraint satisfaction problem has either relational width 1, or relational width (2, 3) (and no smaller width), or does not have bounded relational width.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0709.1934 شماره
صفحات -
تاریخ انتشار 2007